SNAP-STABILIZING PREFIX TREE FOR PEER-TO-PEER SYSTEMS
نویسندگان
چکیده
منابع مشابه
Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems
Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Tries (a.k.a., Prefix Trees) appear to be among promising ways in the design of distributed data structures indexing resources. Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. A ...
متن کاملPeer-to-Peer Prefix Tree for Large Scale Service Discovery
au titre de l'´ ecole doctorale de mathématiques et d'informatique fondamentale de Lyon Présentée et soutenue publiquement le 2 octobre 2008 par Remerciements Le train bouge, les réverbèresà deux têtes qui séparent le quai s'alignent et s'´ eloignent, ¸ ca doitêtre signe que c'est fini... Pourtant, j'aimerais faire le voyage enarrì ere, en accéléré. Je suis assis dans le sens inverse de la marc...
متن کاملSNAP: SNowbAll multi-tree Pushing for Peer-to-Peer Media Streaming
Given the respective advantages of the two complimentary techniques for peer-to-peer media streaming (namely tree-based push and mesh-based pull), there is a strong trend of combining them into a hybrid streaming system. Backed by recently proposed mechanisms to identify stable peers, such a hybrid system usually consists of backbone trees formed by the stable peers and other overlay structures...
متن کاملTree dynamics for peer-to-peer streaming
This paper presents an asynchronous distributed algorithm to manage multiple trees for peer-to-peer streaming in a flow level model. It is assumed that videos are cut into substreams, with or without source coding, to be distributed to all nodes. The algorithm guarantees that each node receives sufficiently many substreams within delay logarithmic in the number of peers. The algorithm works by ...
متن کاملDistributed Decision-Tree Induction in Peer-to-Peer Systems
This paper offers a scalable and robust distributed algorithm for decision tree induction in large Peer-to-Peer (P2P) environments. Computing a decision tree in such large distributed systems using standard centralized algorithms can be very communication-expensive and impractical because of the synchronization requirements. The problem becomes even more challenging in the distributed stream mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 2010
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s012962641000003x